Computation of Distance-Based Topological Indices for Harary Graph H<sub>2m,n</sub>

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distance-Based Topological Indices and Double graph

Let $G$ be a connected graph, and let $D[G]$ denote the double graph of $G$. In this paper, we first derive closed-form formulas for different distance based topological indices for $D[G]$ in terms of that of $G$. Finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...

متن کامل

distance-based topological indices and double graph

let $g$ be a connected graph, and let $d[g]$ denote the double graph of $g$. in this paper, we first derive closed-form formulas for different distance based topological indices for $d[g]$ in terms of that of $g$. finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...

متن کامل

Distance-based topological indices of tensor product of graphs

Let G and H be connected graphs. The tensor product G + H is a graph with vertex set V(G+H) = V (G) X V(H) and edge set E(G + H) ={(a , b)(x , y)| ax ∈ E(G) & by ∈ E(H)}. The graph H is called the strongly triangular if for every vertex u and v there exists a vertex w adjacent to both of them. In this article the tensor product of G + H under some distancebased topological indices are investiga...

متن کامل

Interrelations of Graph Distance Measures Based on Topological Indices

In this paper, we derive interrelations of graph distance measures by means of inequalities. For this investigation we are using graph distance measures based on topological indices that have not been studied in this context. Specifically, we are using the well-known Wiener index, Randić index, eigenvalue-based quantities and graph entropies. In addition to this analysis, we present results fro...

متن کامل

Distance-based Graph Invariants of Trees and the Harary Index

Introduced in 1947, the Wiener index W (T ) = ∑ {u,v}⊆V (T ) d(u, v) is one of the most thoroughly studied chemical indices. The extremal structures (in particular, trees with various constraints) that maximize or minimize the Wiener index have been extensively investigated. The Harary index H(T ) = ∑ {u,v}⊆V (T ) 1 d(u,v) , introduced in 1993, can be considered as the “reciprocal analogue” of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pure Mathematics

سال: 2016

ISSN: 2160-7583,2160-7605

DOI: 10.12677/pm.2016.63022